<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>LibCDS: /home/zsshen/Desktop/git-hub-code/C-Common-Data-Structures/include/container/tree_map.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">LibCDS
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>Globals</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('tree__map_8h_source.html','');});
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">tree_map.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="tree__map_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * @file tree_map.h The ordered map to store key value pairs.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;</div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="preprocessor">#ifndef _TREE_MAP_H_</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define _TREE_MAP_H_</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#include &quot;../util.h&quot;</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">/** TreeMapData is the data type for the container private information. */</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"><a class="line" href="tree__map_8h.html#a6f6e4f4df6632fdbf3d1075f51af07af">   11</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span>_TreeMapData <a class="code" href="tree__map_8h.html#a6f6e4f4df6632fdbf3d1075f51af07af">TreeMapData</a>;</div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">/** The implementation for ordered map. */</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"><a class="line" href="structTreeMap.html">   14</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span>_TreeMap {<span class="comment"></span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">    /** The container private information */</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"><a class="line" href="structTreeMap.html#a0b3580fc846909d246fb8a38eed04b8c">   16</a></span>&#160;    <a class="code" href="tree__map_8h.html#a6f6e4f4df6632fdbf3d1075f51af07af">TreeMapData</a> *<a class="code" href="structTreeMap.html#a0b3580fc846909d246fb8a38eed04b8c">pData</a>;</div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">    /** Insert a key value pair into the map.</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">        @see TreeMapPut */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="structTreeMap.html#a23619fecb4cc03b9dea9e321d533ac74">   20</a></span>&#160;    int32_t (*put) (<span class="keyword">struct </span>_TreeMap*, Pair*);</div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">    /** Retrieve the value corresponding to the designated key.</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">        @see TreeMapGet */</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="structTreeMap.html#ae3ac1a25d27e3f58eee42f2458d46577">   24</a></span>&#160;    int32_t (*<span class="keyword">get</span>) (<span class="keyword">struct </span>_TreeMap*, Key, Value*);</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">    /** Check if the map contains the designated key.</span></div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment">        @see TreeMapFind */</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="structTreeMap.html#aea96058dce2498c396b09f561435f58a">   28</a></span>&#160;    int32_t (*find) (<span class="keyword">struct </span>_TreeMap*, Key);</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">    /** Delete the key value pair corresponding to the designated key.</span></div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment">        @see TreeMapRemove */</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="structTreeMap.html#a55665d1f01d91d8e4280053428cf9c8a">   32</a></span>&#160;    int32_t (*<span class="keyword">remove</span>) (<span class="keyword">struct </span>_TreeMap*, Key);</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="comment">    /** Return the number of stored key value pairs.</span></div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment">        @see TreeMapSize */</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="structTreeMap.html#ad670d2ebfeedc3cdaa18cb1ed1b2ae10">   36</a></span>&#160;    int32_t (*size) (<span class="keyword">struct </span>_TreeMap*);</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment">    /** Retrieve the key value pair with the minimum order from the map.</span></div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment">        @see TreeMapMinimum */</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="structTreeMap.html#a172cd26b06106288bdfbfa3766825f9c">   40</a></span>&#160;    int32_t (*minimum) (<span class="keyword">struct </span>_TreeMap*, Pair**);</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">    /** Retrieve the key value pair with the maximum order from the map.</span></div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="comment">        @see TreeMapMaximum */</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="structTreeMap.html#afd0ec534c018a6275db0e9dc57c505f4">   44</a></span>&#160;    int32_t (*maximum) (<span class="keyword">struct </span>_TreeMap*, Pair**);</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="comment">    /** Retrieve the key value pair which is the predecessor of the given key.</span></div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">        @see TreeMapPredecessor */</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="structTreeMap.html#a91386e61367d2368eebd000353d912e9">   48</a></span>&#160;    int32_t (*predecessor) (<span class="keyword">struct </span>_TreeMap*, Key, Pair**);</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="comment">    /** Retrieve the key value pair which is the successor of the given key.</span></div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="comment">        @see TreeMapSuccessor */</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="structTreeMap.html#a6ee5078a4aa7b4f4efa14526bf341a41">   52</a></span>&#160;    int32_t (*successor) (<span class="keyword">struct </span>_TreeMap*, Key, Pair**);</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment">    /** Iterate through the map from the minimum order to the maximum order.</span></div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="comment">        @see TreeMapIterate */</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="structTreeMap.html#a62a2264b3fd6c89068cdc79242aff4cb">   56</a></span>&#160;    int32_t (*iterate) (<span class="keyword">struct </span>_TreeMap*, bool, Pair**);</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="comment">    /** Iterate through the map from the maximum order to the minimum order.</span></div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="comment">        @see TreeMapReverseIterate */</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="structTreeMap.html#ad2f535fa40c63a1acfd393c7e9561e29">   60</a></span>&#160;    int32_t (*reverse_iterate) (<span class="keyword">struct </span>_TreeMap*, bool, Pair**);</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="comment">    /** Set the custom key comparison method.</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="comment">        @see TreeMapSetCompare */</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="structTreeMap.html#a418ed8c2ae20266a7ae38dd3129fe50d">   64</a></span>&#160;    int32_t (*set_compare) (<span class="keyword">struct </span>_TreeMap*, int32_t (*) (Key, Key));</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="comment">    /** Set the custom key value pair resource clean method.</span></div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="comment">        @see TreeMapSetDestroy */</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="structTreeMap.html#a8027e812c60f174417f5823b5e0bb505">   68</a></span>&#160;    int32_t (*set_destroy) (<span class="keyword">struct </span>_TreeMap*, void (*) (Pair*));</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;} <a class="code" href="structTreeMap.html">TreeMap</a>;</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;<span class="comment">/*===========================================================================*</span></div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="comment"> *             Definition for the exported member operations                 *</span></div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="comment"> *===========================================================================*/</span><span class="comment"></span></div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="comment"> * @brief The constructor for TreeMap.</span></div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="comment"> * @param ppObj         The double pointer to the to be constructed map</span></div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="comment"> * @retval ERR_NOMEM    Insufficient memory for map construction</span></div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;int32_t <a class="code" href="tree__map_8h.html#aced0f18cb2d47f0e358984795be3df8a">TreeMapInit</a>(<a class="code" href="structTreeMap.html">TreeMap</a> **ppObj);</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="comment"> * @brief The destructor for TreeMap.</span></div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="comment"> * If the custom resource clean method is set, it also runs the clean method</span></div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="comment"> * for each pair.</span></div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="comment"> * @param ppObj         The double pointer to the to be destructed map</span></div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="keywordtype">void</span> <a class="code" href="tree__map_8h.html#a296d5303b6e02526e36542afdce932d7">TreeMapDeinit</a>(<a class="code" href="structTreeMap.html">TreeMap</a> **ppObj);</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="comment"> * @brief Insert a key value pair into the map.</span></div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;<span class="comment"> * This function inserts a key value pair into the map. If the order of the</span></div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;<span class="comment"> * designated pair is the same with a certain one stored in the map, that pair</span></div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;<span class="comment"> * will be replaced. Also, if the custom resource clean method is set, it runs</span></div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;<span class="comment"> * the clean method for the replaced pair.</span></div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment"> * @param pPair         The pointer to the designated pair</span></div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="comment"> * @retval ERR_NOMEM    Insufficient memory for map extension</span></div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a2cb91b8efa436584df1dcd9418113e5c">TreeMapPut</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Pair *pPair);</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;<span class="comment"> * @brief Retrieve the value corresponding to the designated key.</span></div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;<span class="comment"> * This function retrieves the value corresponding to the designated key from</span></div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="comment"> * the map. If the key can be found, the value will be returned by the third</span></div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="comment"> * parameter. Otherwise, the error code in returned and the third parameter is</span></div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;<span class="comment"> * updated with NULL.</span></div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;<span class="comment"> * @param key           The designated key</span></div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;<span class="comment"> * @param pValue        The pointer to the returned value</span></div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="comment"> * @retval ERR_NODATA   No map entry can be found</span></div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;<span class="comment"> * @retval ERR_GET      Invalid parameter to store returned value</span></div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;int32_t <a class="code" href="tree__map_8h.html#afac99f9692e4189b452dbc39bd086ee4">TreeMapGet</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Key key, Value *pValue);</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="comment"> * @brief Check if the map contains the designated key.</span></div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="comment"> * @param key           The designated key</span></div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="comment"> * @retval SUCC         The key can be found</span></div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="comment"> * @retval NOKEY        The key cannot be found</span></div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;int32_t <a class="code" href="tree__map_8h.html#ac0625e6795079093de1d082d86398413">TreeMapFind</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Key key);</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="comment"> * @brief Delete the key value pair corresponding to the designated key.</span></div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;<span class="comment"> * This function deletes the key value pair corresponding to the designated key.</span></div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;<span class="comment"> * If the custom resource clean method is set, it runs the clean methods for</span></div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;<span class="comment"> * the deleted pair.</span></div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="comment"> * @param key           The designated key</span></div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;<span class="comment"> * @retval ERR_NODATA   No map entry can be found</span></div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a1b0e88042bb8fba059416422ebf0d6ab">TreeMapRemove</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Key key);</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;<span class="comment"> * @brief Return the number of stored key value pairs.</span></div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;<span class="comment"> * @return              The number of stored pairs</span></div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a72b723785ef79b537b3305a9c9244099">TreeMapSize</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>);</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;<span class="comment"> * @brief Retrieve the key value pair with the minimum order from the map.</span></div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="comment"> * @param ppPair        The double pointer to the returned pair</span></div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="comment"> * @retval ERR_IDX      Empty map</span></div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="comment"> * @retval ERR_GET      Invalid parameter to store returned pair</span></div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a27eff230144c1b126c4851b12b195331">TreeMapMinimum</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Pair **ppPair);</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;<span class="comment"> * @brief Retrieve the key value pair with the maximum order from the map.</span></div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;<span class="comment"> * @param ppPair        The double pointer to the returned pair</span></div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="comment"> * @retval ERR_IDX      Empty map</span></div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="comment"> * @retval ERR_GET      Invalid parameter to store returned pair</span></div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a534d5b9030b8f20f365fa911843f56a0">TreeMapMaximum</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Pair **ppPair);</div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="comment"> * @brief Retrieve the key value pair which is the predecessor of the given key.</span></div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;<span class="comment"> * @param key           The designated key</span></div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="comment"> * @param ppPair        The double pointer to the returned pair</span></div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;<span class="comment"> * @retval ERR_NODATA   Non-existent immediate predecessor</span></div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;<span class="comment"> * @retval ERR_GET      Invalid parameter to store returned pair</span></div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a400b43cf750c51cb02fd284bf5f45698">TreeMapPredecessor</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Key key, Pair **ppPair);</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;<span class="comment"> * @brief Retrieve the key value pair which is the successor of the given key.</span></div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="comment"> * @param key           The designated key</span></div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;<span class="comment"> * @param ppPair        The double pointer to the returned pair</span></div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;<span class="comment"> * @retval ERR_NODATA   Non-existent immediate successor</span></div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;<span class="comment"> * @retval ERR_GET      Invalid parameter to store returned pair</span></div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a54d38e9eae8308b8fb0d4c0469520b91">TreeMapSuccessor</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, Key key, Pair **ppPair);</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;<span class="comment"> * @brief Iterate through the map from the minimum order to the maximum order.</span></div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;<span class="comment"> * Before iterating through the map, it is necessary to pass:</span></div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;<span class="comment"> *  - bReset = true</span></div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;<span class="comment"> *  - pPair = NULL</span></div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;<span class="comment"> * for iterator initialization.</span></div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;<span class="comment"> * After initialization, you can pass:</span></div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;<span class="comment"> *  - bReset = false</span></div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;<span class="comment"> *  - pPair = the pointer to get the returned pair at each iteration.</span></div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="comment"> * @param bReset        The knob to restart the iteration</span></div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;<span class="comment"> * @param ppPair        The double pointer to the returned pair</span></div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;<span class="comment"> * @retval SUCC         Iterator initialized successfully</span></div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="comment"> * @retval CONTINUE     Iteration in progress</span></div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;<span class="comment"> * @retval END          Iteration terminiated</span></div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;<span class="comment"> * @retval ERR_GET      Invalid parameter to store returned pair</span></div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a2982b98fafa5703c7220478bd0d29bcf">TreeMapIterate</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, <span class="keywordtype">bool</span> bReset, Pair **ppPair);</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;<span class="comment"> * @brief Reversely iterate through the map from the minimum order to the</span></div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;<span class="comment"> *  maximum order.</span></div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="comment"> * Before iterating through the map, it is necessary to pass:</span></div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="comment"> *  - bReset = true</span></div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;<span class="comment"> *  - pPair = NULL</span></div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;<span class="comment"> * for iterator initialization.</span></div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;<span class="comment"> * After initialization, you can pass:</span></div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;<span class="comment"> *  - bReset = false</span></div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;<span class="comment"> *  - pPair = the pointer to get the returned pair at each iteration.</span></div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;<span class="comment"> * @param bReset        The knob to restart the iteration</span></div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="comment"> * @param ppPair        The double pointer to the returned pair</span></div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;<span class="comment"> * @retval SUCC         Iterator initialized successfully</span></div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;<span class="comment"> * @retval CONTINUE     Iteration in progress</span></div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;<span class="comment"> * @retval END          Iteration terminiated</span></div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;<span class="comment"> * @retval ERR_GET      Invalid parameter to store returned pair</span></div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;int32_t <a class="code" href="tree__map_8h.html#a91cb4be6a5e7e775d66b9a536463db87">TreeMapReverseIterate</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, <span class="keywordtype">bool</span> bReset, Pair **ppPair);</div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;<span class="comment"> * @brief Set the custom key comparison method.</span></div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;<span class="comment"> * @param pFunc         The function pointer to the custom method</span></div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;int32_t <a class="code" href="tree__map_8h.html#ab744090c91ce404e0f4853599ecf3649">TreeMapSetCompare</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, int32_t (*pFunc) (Key, Key));</div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="comment"> * @brief Set the custom key value pair resource clean method.</span></div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;<span class="comment"> * @param self          The pointer to TreeMap structure</span></div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;<span class="comment"> * @param pFunc         The function pointer to the custom method</span></div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;<span class="comment"> * @retval SUCC</span></div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;<span class="comment"> * @retval ERR_NOINIT   Uninitialized container</span></div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;int32_t <a class="code" href="tree__map_8h.html#ab3385c339bc1eb4047d0d7af472febec">TreeMapSetDestroy</a>(<a class="code" href="structTreeMap.html">TreeMap</a> *<span class="keyword">self</span>, <span class="keywordtype">void</span> (*pFunc) (Pair*));</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;</div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="ttc" id="structTreeMap_html"><div class="ttname"><a href="structTreeMap.html">TreeMap</a></div><div class="ttdoc">The implementation for ordered map. </div><div class="ttdef"><b>Definition:</b> <a href="tree__map_8h_source.html#l00014">tree_map.h:14</a></div></div>
<div class="ttc" id="tree__map_8h_html_a400b43cf750c51cb02fd284bf5f45698"><div class="ttname"><a href="tree__map_8h.html#a400b43cf750c51cb02fd284bf5f45698">TreeMapPredecessor</a></div><div class="ttdeci">int32_t TreeMapPredecessor(TreeMap *self, Key key, Pair **ppPair)</div><div class="ttdoc">Retrieve the key value pair which is the predecessor of the given key. </div></div>
<div class="ttc" id="tree__map_8h_html_a2cb91b8efa436584df1dcd9418113e5c"><div class="ttname"><a href="tree__map_8h.html#a2cb91b8efa436584df1dcd9418113e5c">TreeMapPut</a></div><div class="ttdeci">int32_t TreeMapPut(TreeMap *self, Pair *pPair)</div><div class="ttdoc">Insert a key value pair into the map. </div></div>
<div class="ttc" id="tree__map_8h_html_a54d38e9eae8308b8fb0d4c0469520b91"><div class="ttname"><a href="tree__map_8h.html#a54d38e9eae8308b8fb0d4c0469520b91">TreeMapSuccessor</a></div><div class="ttdeci">int32_t TreeMapSuccessor(TreeMap *self, Key key, Pair **ppPair)</div><div class="ttdoc">Retrieve the key value pair which is the successor of the given key. </div></div>
<div class="ttc" id="tree__map_8h_html_a27eff230144c1b126c4851b12b195331"><div class="ttname"><a href="tree__map_8h.html#a27eff230144c1b126c4851b12b195331">TreeMapMinimum</a></div><div class="ttdeci">int32_t TreeMapMinimum(TreeMap *self, Pair **ppPair)</div><div class="ttdoc">Retrieve the key value pair with the minimum order from the map. </div></div>
<div class="ttc" id="tree__map_8h_html_ab744090c91ce404e0f4853599ecf3649"><div class="ttname"><a href="tree__map_8h.html#ab744090c91ce404e0f4853599ecf3649">TreeMapSetCompare</a></div><div class="ttdeci">int32_t TreeMapSetCompare(TreeMap *self, int32_t(*pFunc)(Key, Key))</div><div class="ttdoc">Set the custom key comparison method. </div></div>
<div class="ttc" id="tree__map_8h_html_a2982b98fafa5703c7220478bd0d29bcf"><div class="ttname"><a href="tree__map_8h.html#a2982b98fafa5703c7220478bd0d29bcf">TreeMapIterate</a></div><div class="ttdeci">int32_t TreeMapIterate(TreeMap *self, bool bReset, Pair **ppPair)</div><div class="ttdoc">Iterate through the map from the minimum order to the maximum order. </div></div>
<div class="ttc" id="tree__map_8h_html_ac0625e6795079093de1d082d86398413"><div class="ttname"><a href="tree__map_8h.html#ac0625e6795079093de1d082d86398413">TreeMapFind</a></div><div class="ttdeci">int32_t TreeMapFind(TreeMap *self, Key key)</div><div class="ttdoc">Check if the map contains the designated key. </div></div>
<div class="ttc" id="structTreeMap_html_a0b3580fc846909d246fb8a38eed04b8c"><div class="ttname"><a href="structTreeMap.html#a0b3580fc846909d246fb8a38eed04b8c">TreeMap::pData</a></div><div class="ttdeci">TreeMapData * pData</div><div class="ttdoc">The container private information. </div><div class="ttdef"><b>Definition:</b> <a href="tree__map_8h_source.html#l00016">tree_map.h:16</a></div></div>
<div class="ttc" id="tree__map_8h_html_a1b0e88042bb8fba059416422ebf0d6ab"><div class="ttname"><a href="tree__map_8h.html#a1b0e88042bb8fba059416422ebf0d6ab">TreeMapRemove</a></div><div class="ttdeci">int32_t TreeMapRemove(TreeMap *self, Key key)</div><div class="ttdoc">Delete the key value pair corresponding to the designated key. </div></div>
<div class="ttc" id="tree__map_8h_html_a6f6e4f4df6632fdbf3d1075f51af07af"><div class="ttname"><a href="tree__map_8h.html#a6f6e4f4df6632fdbf3d1075f51af07af">TreeMapData</a></div><div class="ttdeci">struct _TreeMapData TreeMapData</div><div class="ttdoc">TreeMapData is the data type for the container private information. </div><div class="ttdef"><b>Definition:</b> <a href="tree__map_8h_source.html#l00011">tree_map.h:11</a></div></div>
<div class="ttc" id="tree__map_8h_html_a534d5b9030b8f20f365fa911843f56a0"><div class="ttname"><a href="tree__map_8h.html#a534d5b9030b8f20f365fa911843f56a0">TreeMapMaximum</a></div><div class="ttdeci">int32_t TreeMapMaximum(TreeMap *self, Pair **ppPair)</div><div class="ttdoc">Retrieve the key value pair with the maximum order from the map. </div></div>
<div class="ttc" id="tree__map_8h_html_afac99f9692e4189b452dbc39bd086ee4"><div class="ttname"><a href="tree__map_8h.html#afac99f9692e4189b452dbc39bd086ee4">TreeMapGet</a></div><div class="ttdeci">int32_t TreeMapGet(TreeMap *self, Key key, Value *pValue)</div><div class="ttdoc">Retrieve the value corresponding to the designated key. </div></div>
<div class="ttc" id="tree__map_8h_html_ab3385c339bc1eb4047d0d7af472febec"><div class="ttname"><a href="tree__map_8h.html#ab3385c339bc1eb4047d0d7af472febec">TreeMapSetDestroy</a></div><div class="ttdeci">int32_t TreeMapSetDestroy(TreeMap *self, void(*pFunc)(Pair *))</div><div class="ttdoc">Set the custom key value pair resource clean method. </div></div>
<div class="ttc" id="tree__map_8h_html_a72b723785ef79b537b3305a9c9244099"><div class="ttname"><a href="tree__map_8h.html#a72b723785ef79b537b3305a9c9244099">TreeMapSize</a></div><div class="ttdeci">int32_t TreeMapSize(TreeMap *self)</div><div class="ttdoc">Return the number of stored key value pairs. </div></div>
<div class="ttc" id="tree__map_8h_html_a91cb4be6a5e7e775d66b9a536463db87"><div class="ttname"><a href="tree__map_8h.html#a91cb4be6a5e7e775d66b9a536463db87">TreeMapReverseIterate</a></div><div class="ttdeci">int32_t TreeMapReverseIterate(TreeMap *self, bool bReset, Pair **ppPair)</div><div class="ttdoc">Reversely iterate through the map from the minimum order to the maximum order. </div></div>
<div class="ttc" id="tree__map_8h_html_a296d5303b6e02526e36542afdce932d7"><div class="ttname"><a href="tree__map_8h.html#a296d5303b6e02526e36542afdce932d7">TreeMapDeinit</a></div><div class="ttdeci">void TreeMapDeinit(TreeMap **ppObj)</div><div class="ttdoc">The destructor for TreeMap. </div></div>
<div class="ttc" id="tree__map_8h_html_aced0f18cb2d47f0e358984795be3df8a"><div class="ttname"><a href="tree__map_8h.html#aced0f18cb2d47f0e358984795be3df8a">TreeMapInit</a></div><div class="ttdeci">int32_t TreeMapInit(TreeMap **ppObj)</div><div class="ttdoc">The constructor for TreeMap. </div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_e0f5f6345e438c73b9ae78ec2940718c.html">container</a></li><li class="navelem"><a class="el" href="tree__map_8h.html">tree_map.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
